Scheduling in an assembly-type production chain with batch transfer
نویسندگان
چکیده
منابع مشابه
Scheduling in an Assembly-Type Production Chain with Batch Transfer
This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second-stage of a flowshop for processing the component parts in batch...
متن کاملBatch Splitting in an Assembly Scheduling Environment
This paper presents mathematical models and algorithms for a production scheduling problem with batch splitting of assembly operations. The operation precedence is represented in an operations network, and the operations at any particular workcenter are split into suitable batch sizes on the available identical parallel processors for faster completion. The solution methodology comprises of a b...
متن کاملScheduling Accumulated Rework in a Normal Cycle: Optimal Batch Production with Minimum Rework Cycles
In this paper we consider a single machine system that produces items part of which are defective. The defective items produced in a time period, consisting of several equal cycles, are accumulated and are all reworked in the last cycle of this period called the rework cycle. At the end of the rework cycle the whole process will start all over again. The first significant objective of this stud...
متن کاملCoordinating Order Acceptance and Batch Delivery for an Integrated Supply Chain Scheduling
This paper develops Order Acceptance for an Integrated Production-Distribution Problem in which Batch Delivery is implemented. The aim of this problem is to coordinate: (1) rejecting some of the orders (2) production scheduling of the accepted orders and (3) batch delivery to maximize Total Net Profit. A Mixed Integer Programming is proposed for the problem. In addition, a hybrid meta-heuristic...
متن کاملUet-scheduling with Chain-type Precedence Constraints Uet|scheduling with Chain-type Precedence Constraints
x{ Scope and Purpose. | We consider a scheduling problem in a two-processor system where (i) every job can be processed on only one machine and where (ii) there are chain-type precedence relations among the jobs. The goal is to minimize the makespan. This continues the work of Chang and Lee 1], Jansen 4] and of Kellerer and Woeginger 5]. Abstract. | We consider a special case of the precedence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2007
ISSN: 0305-0483
DOI: 10.1016/j.omega.2005.04.004